Illumination Removal via Gaussian Difference L0 Norm Model for Facial Experssion Recognition

نویسندگان

چکیده

Face images in the logarithmic space can be considered as a sum of texture component and lighting map according to Lambert Reflection. However, it is still not easy separate these two parts, because face contour boundaries change are difficult distinguish. In order enhance separation quality this paper proposes an illumination standardization algorithm based on extreme L0 Gaussian difference regularization constraints, assuming that massively spread all over image but simple, regular, sparse enough. The proposed uses iterative smoothing method, which achieves more accurate estimation by reserving fewest boundaries. Thus, original restored better simply subtracting estimated. experiments organized with steps: first step observe restoration, second test effectiveness our for complex classification tasks. We choose facial expression step. experimental results show effectively recover details from extremely dark or light regions. experiment, we use CNN classifier emotion accuracy, making comparison removal state-of-the-art preprocessing methods. works best at about 5 7 percent accuracy higher than other algorithms. Therefore, proven provide effective processing technical support problems require high degree preservation texture. contribution is, first, enhanced TV model boundary constraint estimation. Second, response formulated difference, strongly responds Third, emphasizes necessity images.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Penalty Decomposition Methods for $L0$-Norm Minimization

In this paper we consider general l0-norm minimization problems, that is, the problems with l0-norm appearing in either objective function or constraint. In particular, we first reformulate the l0-norm constrained problem as an equivalent rank minimization problem and then apply the penalty decomposition (PD) method proposed in [33] to solve the latter problem. By utilizing the special structur...

متن کامل

Gaussian Mixture Models for Human Face Recognition under Illumination Variations

The appearance of a face is severely altered by illumination conditions that makes automatic face recognition a challenging task. In this paper we propose a Gaussian Mixture Models (GMM)-based human face identification technique built in the Fourier or frequency domain that is robust to illumination changes and does not require “illumination normalization” (removal of illumination effects) prio...

متن کامل

Sparse LS-SVMs with L0 - norm minimization

Least-Squares Support Vector Machines (LS-SVMs) have been successfully applied in many classification and regression tasks. Their main drawback is the lack of sparseness of the final models. Thus, a procedure to sparsify LS-SVMs is a frequent desideratum. In this paper, we adapt to the LS-SVM case a recent work for sparsifying classical SVM classifiers, which is based on an iterative approximat...

متن کامل

Sparse Representation of White Gaussian Noise with Application to L0-Norm Decoding in Noisy Compressed Sensing

The achievable and converse regions for sparse representation of white Gaussian noise based on an overcomplete dictionary are derived in the limit of large systems. Furthermore, the marginal distribution of such sparse representations is also inferred. The results are obtained via the Replica method which stems from statistical mechanics. A direct outcome of these results is the introduction of...

متن کامل

Learning Sparse Gaussian Graphical Model with l0-regularization

For the problem of learning sparse Gaussian graphical models, it is desirable to obtain both sparse structures as well as good parameter estimates. Classical techniques, such as optimizing the l1-regularized maximum likelihood or Chow-Liu algorithm, either focus on parameter estimation or constrain to specific structure. This paper proposes an alternative that is based on l0-regularized maximum...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11122667